Exact Identification of Circuits Using Fixed Points of Amplification Functions (Extended Abstract)

In this paper we describe a new technique for ezactly identifying certain classes of read-once Boolean formulas. The method is based on sampling the input-output behavior of the target formula on a probability distribution which is determined by the fized point of the formula's amplification function (defined as the probability that a 1 is output by the formula when each input bit is 1 independently with probability p ) . By performing various statistical tests on easily sampled variants of the fixed-point distribution, we are able to efficiently infer all structural information about any logarithmic-depth target formula (with high probability). We apply our results to prove the existence of short universal identification sequences for large classes of formulas. We also describe extensions of our algorithms to handle high rates of noise, and to learn formulas of unbounded depth in Valiant's model with respect to specific distributions.